On relevantly derivable disjunctions.
نویسندگان
چکیده
منابع مشابه
Left derivable or Jordan left derivable mappings on Banach algebras
Let $mathcal{A}$ be a unital Banach algebra, $mathcal{M}$ be a left $mathcal{A}$-module, and $W$ in $mathcal{Z}(mathcal{A})$ be a left separating point of $mathcal{M}$. We show that if $mathcal{M}$ is a unital left $mathcal{A}$-module and $delta$ is a linear mapping from $mathcal{A}$ into $mathcal{M}$, then the following four conditions are equivalent: (i) $delta$ is a Jordan left de...
متن کاملDerivable Type Classes
Generi programming allows you to write a fun tion on e, and use it many times at di erent types. A lot of good foundational work on generi programming has been done. The goal of this paper is to propose a pra ti al way of supporting generi programming within the Haskell language, without radi ally hanging the language or its type system. The key idea is to present generi programming as a ri her...
متن کاملBranching on general disjunctions
This paper considers a modification of the branch-and-cut algorithm for Mixed Integer Linear Programming where branching is performed on general disjunctions rather than on variables. We select promising branching disjunctions based on a heuristic measure of disjunction quality. This measure exploits the relation between branching disjunctions and intersection cuts. In this work, we focus on di...
متن کاملBranching on Split Disjunctions
Branch-and-Cut is the most commonly used algorithm for solving Integer and Mixed-Integer Linear Programs. In order to reduce the number of nodes that have to be enumerated before optimality of a solution can be proven, branching on general disjunctions (i.e. split disjunctions involving more than one variable, as opposed to branching on simple disjunctions defined on one variable only) was show...
متن کاملClosed Non-derivable Itemsets
Itemset mining typically results in large amounts of redundant itemsets. Several approaches such as closed itemsets, non-derivable itemsets and generators have been suggested for losslessly reducing the amount of itemsets. We propose a new pruning method based on combining techniques for closed and non-derivable itemsets that allows further reductions of itemsets. This reduction is done without...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Notre Dame Journal of Formal Logic
سال: 1972
ISSN: 0029-4527
DOI: 10.1305/ndjfl/1093890708